Dual Fine-Grained Public-Key Searchable Encryption from Lattices

Fine-grained public key encryption with keyword search (PEKS), allowing users to on encrypted data flexible access control policy, has been widely studied recently due its promising application real-world scenarios such as cloud computing. However, most of the existing fine-grained PEKS schemes are either only able support single (e.g., attribute-based control) or susceptible being attacked compromised by quantum computers in after a short time. In this paper, we propose scheme that o ers dual based lattice. particular, first define primitive against chosen attacks under selective security. Subsequently, adapt homomorphic technique and noise rerandomization design concrete scheme. Particularly, space our construction is unlimited. Then, present formal security proof learning errors (LWE) problem standard model. Moreover, demonstrate theoretical performance experimental result proposed Finally, discuss can be easily extended conjunctive keywords delegation without incurring complex operations.